| 翻訳と辞書 |
| György Elekes ： ウィキペディア英語版 |
György Elekes
György Elekes ( – )〔(【引用サイトリンク】title=Obituary )〕 was a Hungarian mathematician and computer scientist who specialized in Combinatorial geometry and Combinatorial set theory. He may be best known for his work in the field that would eventually be called Additive Combinatorics. Particularly notable was his "ingenious" application of the Szemerédi–Trotter theorem to improve the best known lower bound for the sum-product problem. He also proved that any polynomial-time algorithm approximating the volume of convex bodies must have a multiplicative error, and the error grows exponentially on the dimension.〔 With Micha Sharir he set up a framework which eventually led Guth and Katz to the solution of the Erdős distinct distances problem.〔(The Erdős distance problem )〕 (See below.)
==Life==
After graduating from the mathematics program at Fazekas Mihály Gimnázium (i.e., "Fazekas Mihály high school" in Budapest, which is known for its excellence, especially in mathematics), Elekes studied mathematics at the Eötvös Loránd University. Upon completing his degree, he joined the faculty in the Department of Analysis at the university. In 1984, he joined the newly forming Department of Computer Science, which was being headed by László Lovász. Elekes was promoted to full professor in 2005. He received the ''Doctor of Mathematical Sciences'' title from the Hungarian Academy of Sciences in 2001.〔
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「György Elekes」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|